Reachability on prefix-recognizable graphs
نویسندگان
چکیده
منابع مشابه
Reachability on prefix-recognizable graphs
We prove that on prefix-recognizable graphs reachability is complete for deterministic exponential time matching the complexity of alternating reachability.
متن کامل15 Prefix-Recognizable Graphs and Monadic Logic
In 1969, Rabin [148] showed that the monadic second-order theory (MSO-theory) of infinite binary trees is decidable (see Chapter 12 of this volume or [183]). Ever since, it has been an interesting goal to extend this result to other classes of objects. Muller and Schupp [135] showed that the class of pushdown graphs has a decidable MSO-theory. This class is obtained by considering the configura...
متن کاملUniform Solution of Parity Games on Prefix-Recognizable Graphs
Walukiewicz gave in 1996 a solution for parity games on pushdown graphs: he proved the existence of pushdown strategies and determined the winner with an EXPTIME procedure. We give a new presentation and a new algorithmic proof of these results, obtain a uniform solution for parity games (independent of their initial configuration), and extend the results to prefix-recognizable graphs. The winn...
متن کاملRecognizable colorings of graphs
Let G be a connected graph and let c : V (G) → {1, 2, . . . , k} be a coloring of the vertices of G for some positive integer k (where adjacent vertices may be colored the same). The color code of a vertex v of G (with respect to c) is the ordered (k+1)-tuple code(v) = (a0, a1, . . . , ak) where a0 is the color assigned to v and for 1 ≤ i ≤ k, ai is the number of vertices adjacent to v that are...
متن کاملModel Checking Linear Properties of Prefix-Recognizable Systems
We develop an automata-theoretic framework for reasoning about linear properties of infinite-state sequential systems. Our framework is based on the observation that states of such systems, which carry a finite but unbounded amount of information, can be viewed as nodes in an infinite tree, and transitions between states can be simulated by finite-state automata. Checking that the system satisf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2008
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2008.04.008